Spi Computations on Grids Computations on Grids Computations on Grids
نویسنده
چکیده
We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de dimension un peut ^ etre utilis e pour mouvoir et composer des zones de calcul dans l'espace-temps. Ceci nous permet de d eenir des algorithmes complexes en s'aaranchissant par certains aspects du synchronisme inh erent a de tels r eseaux. Abstract We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular au-tomata, relaxing in some way the inherent synchronism of such networks .
منابع مشابه
An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications
Computational Grids are becoming attractive and promising platforms for solving large-scale (problem solving) applications of multi-institutional interest. However, the management of resources and scheduling computations in the Grid environment is a complex undertaking as they are (geographically) distributed, heterogeneous in nature, owned by different individuals or organisations with their o...
متن کاملMinimizing Cache Misses in Scientific Computing Using Isoperimetric Bodies
A number of known techniques for improving cache performance in scientific computations involve the reordering of the iteration space. Some of these reorderings can be considered coverings of the iteration space with sets having small surfaceto-volume ratios. Use of such sets may reduce the number of cache misses in computations of local operators having the iteration space as their domain. Fir...
متن کاملNumerical Computation of Discrete Differential Operators on Non-Uniform Grids
In this paper, we explore the numerical approximation of discrete differential operators on nonuniform grids. The Voronoi cell and the notion of natural neighbors are used to approximate the Laplacian and the gradient operator on irregular grids. The underlying weight measure used in the numerical computations is the Laplace weight function, which has been previously adopted in meshless Galerki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998